Method, Apparatus, and Computer Program Product for Intelligent Open Query Cursor Management

ABSTRACT

An enhanced mechanism for intelligently managing an open query cursor built from a query access plan (AP) by a query optimizer of a database management system (DBMS). In an embodiment, a cursor management system (CMS) detects whether an open query cursor was previously requested for use within another job. If the open query cursor was previously requested, the CMS intelligently manages the query cursor for subsequent use within a different job. For example, the open query cursor may be recycled for subsequent use within the different job. Hence, system resources are not wasted in building and destroying the same cursors for multiple jobs. Alternatively, the query cursor may be pre-built before the cursor is requested for subsequent use within the different job. The CMS may also obtain, release and re-obtain locks for cursors being managed. Alternatively, the job that uses the cursor may obtain the lock.

BACKGROUND OF THE INVENTION

1. Field of Invention

The present invention relates in general to the digital data processingfield. More particularly, the present invention relates to a mechanismfor intelligently managing an open query cursor built from a queryaccess plan (AP) by a query optimizer of a database management system(DBMS).

2. Background Art

In the latter half of the twentieth century, there began a phenomenonknown as the information revolution. While the information revolution isa historical development broader in scope than any one event or machine,no single device has come to represent the information revolution morethan the digital electronic computer. The development of computersystems has surely been a revolution. Each year, computer systems growfaster, store more data, and provide more applications to their users.

A modern computer system typically comprises at least one centralprocessing unit (CPU) and supporting hardware, such as communicationsbuses and memory, necessary to store, retrieve and transfer information.It also includes hardware necessary to communicate with the outsideworld, such as input/output controllers or storage controllers, anddevices attached thereto such as keyboards, monitors, tape drives, diskdrives, communication lines coupled to a network, etc. The CPU or CPUsare the heart of the system. They execute the instructions whichcomprise a computer program and direct the operation of the other systemcomponents.

The overall speed of a computer system is typically improved byincreasing parallelism, and specifically, by employing multiple CPUs(also referred to as processors). The modest cost of individualprocessors packaged on integrated circuit chips has made multiprocessorsystems practical, although such multiple processors add more layers ofcomplexity to a system.

From the standpoint of the computer's hardware, most systems operate infundamentally the same manner. Processors are capable of performing verysimple operations, such as arithmetic, logical comparisons, and movementof data from one location to another. But each operation is performedvery quickly. Sophisticated software at multiple levels directs acomputer to perform massive numbers of these simple operations, enablingthe computer to perform complex tasks. What is perceived by the user asa new or improved capability of a computer system is made possible byperforming essentially the same set of very simple operations, usingsoftware having enhanced function, along with faster hardware.

The overall value or worth of a computer system depends largely upon howwell the computer system stores, manipulates, and analyzes data. Onemechanism for managing data is called a database management system(DBMS), which is also referred to as a database system or simply a“database”.

At a most basic level, a database stores data as a series of logicaltables. Each table is made up of rows and columns. Each table has aunique name within the database and each column has a unique name withinthe particular table. Different statements called queries allow the useror an application program to obtain data from the database. As one mightimagine, queries range from being very simple to very complex.

When a database receives a query, the database interprets the query anddetermines what internal steps are necessary to satisfy the query. Theseinternal steps may include identification of the table or tablesspecified in the query, the row or rows selected in the query, and otherinformation such as whether to use an existing index, whether to build atemporary index, whether to use a temporary file to execute a sort,and/or the order in which the tables are to be joined together tosatisfy the query. When taken together, these internal steps aretypically referred to as an access plan (AP), although they aresometimes referred to as an execution plan.

The access plan is typically created by a software component that isoften called a query optimizer. For a single given query, the currentstate of the art for database performance is as close to optimal as canbe achieved. Further database performance gains can only be found inmore intelligent reuse techniques among multiple queries.

One reuse technique relates to access plan reuse. Consequently, when aquery optimizer creates an access plan for a given query, the accessplan is often saved by the database management system in an access plancache. The access plan may also be saved in an SQL (Structured QueryLanguage) package or in a program object, e.g., the application programthat requested the query. Then, when the user or program object repeatsthe query, the database can reutilize the saved access plan instead ofundergoing the time-consuming process of recreating it.

Query access plan reuse is well known in the art. For example, U.S. Pat.No. 7,133,861 B2, entitled “QUERY ACCESS PLAN REUSE”, issued on Nov. 7,2006 to Day et al., and assigned to IBM Corporation, discloses a method,apparatus and system that determines when to rebuild a query accessplan.

Another reuse technique relates to the reuse of an open query cursor,which, as explained below, is the query executable structure built froma query access plan. Open query cursor reuse is a very differenttechnology than query access plan reuse.

Query cursors are associated with multirow queries. Query cursors alsocan be associated with single row queries. A multirow query is a querythat returns more than one row and its execution is handled in twostages. First, the program starts the query, although no data isreturned immediately. Then, the program requests the rows of data one ata time.

These operations are performed using a special data object called a“cursor”. A cursor is an executable data structure that represents thestate of a query, either single row or multirow, and is built from aquery access plan. The following list shows the general sequence ofprogram operations:

1. The program declares the cursor and its associated SELECT statement,which merely allocates storage to hold the cursor.

2. The program opens the cursor, which starts the execution of theassociated SELECT statement and detects any errors in it.

3. The program fetches a row of data into host variables and processesit.

4. The program closes the cursor after the last row is fetched.

5. When the cursor is no longer needed, the program frees the cursor todeallocate the resources it uses.

These operations may, for example, be performed with SQL statementsnamed DECLARE, OPEN, FETCH, CLOSE, and FREE. Thus, an open query cursor,which is sometimes referred to as an open data path (ODP), is the objectbuilt when a user or application program issues an SQL OPEN statement,and is the live object which returns rows when a user or applicationprogram issues an SQL FETCH statement. Although SQL is a commoninterface, other interfaces such as QUERY (IBM iSeries), DDL, XML, etc.may be used to perform the requisite operations.

In the current state of the art, a query cursor within a particularjob/process/thread may be reused if that query is rerun within the samejob/process/thread. However, there is currently no means to reuse aquery cursor for a different job. Thus, system resources are wasted inbuilding and destroying the same cursors for multiple jobs, asillustrated by the following two problem scenarios.

In a first illustrative problem scenario, one thousand users at atypical call center logon their computer system at 8:00 am. They all runan application with twenty-five common queries. Therefore, at 8:00 am,the computer system must perform “full opens” on twenty-five thousandqueries (i.e., 1000×25 queries). At a CPU cost of about ½ second per afull open, a considerable CPU cost spike of 208 CPU minutes occurs at8:00 am. A similar CPU cost spike may be felt at other times during theday, such as after lunch when all of the users again logon theircomputer system.

A second illustrative problem scenario occurs, for example, in thecontext of an online web retail application. Multiple users throughoutthe day run a handful of the same queries, such as lookup product X.Each of the users must pay a full open hit when they sign on, as thecursors are built, when the query is run, when the query is closed, andwhen the ODP is destroyed. No users benefit from the similar full opensof other users that occurred previously. Consequently, CPU time iswasted by building the same query cursor over and over for differentusers.

Therefore, a need exists for an enhanced mechanism for intelligentre-use of an open query cursor.

SUMMARY OF THE INVENTION

According to the preferred embodiments of the present invention, acursor management system (CMS) provides intelligent open query cursormanagement. An open query cursor is built from a query access plan (AP)by a query optimizer of a database management system (DBMS). The CMSdetects whether the open query cursor was previously requested for usewithin another job. If the open query cursor was previously requested,the CMS intelligently manages the query cursor for subsequent use withina different job. For example, the open query cursor may be recycled forsubsequent use within the different job. Hence, system resources are notwasted in building and destroying the same cursors for multiple jobs.Alternatively, the query cursor may be pre-built before the cursor isrequested for subsequent use within the different job.

According to another aspect of the preferred embodiments of the presentinvention, the CMS may also obtain, release and re-obtain locks forcursors being managed. Alternatively, the job that uses the cursor mayobtain the lock.

The foregoing and other features and advantages of the invention will beapparent from the following more particular description of the preferredembodiments of the invention, as illustrated in the accompanyingdrawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The preferred exemplary embodiments of the present invention willhereinafter be described in conjunction with the appended drawings,where like designations denote like elements.

FIG. 1 is a block diagram of a computer apparatus for intelligent openquery management in accordance with the preferred embodiments of thepresent invention.

FIG. 2 is a flow diagram illustrating a method for intelligent openquery cursor management by recycling query cursors in accordance withthe preferred embodiments of the present invention.

FIG. 3 is a flow diagram illustrating a method for intelligent openquery cursor management by pre-building query cursors in accordance withthe preferred embodiments of the present invention.

FIG. 4 is a flow diagram illustrating a method for intelligent openquery cursor management that incorporates a lock management mechanism inaccordance with the preferred embodiments of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

1.0 Overview

In accordance with the preferred embodiments of the present invention, acursor management system (CMS) provides intelligent open query cursormanagement. An open query cursor is built from a query access plan (AP)by a query optimizer of a database management system (DBMS). The CMSdetects whether the open query cursor was previously requested for usewithin another job. If the open query cursor was previously requested,the CMS intelligently manages the query cursor for subsequent use withina different job. For example, the open query cursor may be recycled forsubsequent use within the different job. Hence, system resources are notwasted in building and destroying the same cursors for multiple jobs.Alternatively, the query cursor may be pre-built before the cursor isrequested for subsequent use within the different job.

In accordance with another aspect of the preferred embodiments of thepresent invention, the CMS may also obtain, release and re-obtain locksfor cursors being managed. Alternatively, the job that uses the cursormay obtain the lock.

2.0 Detailed Description

A computer system implementation of the preferred embodiments of thepresent invention will now be described with reference to FIG. 1 in thecontext of a particular computer system 100, i.e., an IBM eServeriSeries or System i computer system. However, those skilled in the artwill appreciate that the method, apparatus, and computer program productof the present invention apply equally to any computer system,regardless of whether the computer system is a complicated multi-usercomputing apparatus, a single user workstation, a PC, or an embeddedcontrol system. As shown in FIG. 1, computer system 100 comprises a oneor more processors 101A, 101B, 101C and 101D, a main memory 102, a massstorage interface 104, a display interface 106, a network interface 108,and an I/O device interface 109. These system components areinterconnected through the use of a system bus 110.

FIG. 1 is intended to depict the representative major components ofcomputer system 100 at a high level, it being understood that individualcomponents may have greater complexity than represented in FIG. 1, andthat the number, type and configuration of such components may vary. Forexample, computer system 100 may contain a different number ofprocessors than shown.

Processors 101A, 101B, 101C and 101D (also collectively referred toherein as “processors 101”) process instructions and data from mainmemory 102. Processors 101 temporarily hold instructions and data in acache structure for more rapid access. In the embodiment shown in FIG.1, the cache structure comprises caches 103A, 103B, 103C and 103D (alsocollectively referred to herein as “caches 103”) each associated with arespective one of processors 101A, 101B, 101C and 101D. For example,each of the caches 103 may include a separate internal level oneinstruction cache (L1 I-cache) and level one data cache (L1 D-cache),and level two cache (L2 cache) closely coupled to a respective one ofprocessors 101. However, it should be understood that the cachestructure may be different; that the number of levels and division offunction in the cache may vary; and that the system might in fact haveno cache at all.

Main memory 102 in accordance with the preferred embodiments containsdata 116, an operating system 118 and application software, utilitiesand other types of software. In addition, main memory 102 includes adatabase management system (DBMS) 120, a program object 122, a job space124, and a database 126, all of which may in various embodiments existin any number. Although the DBMS 120, the program object 122, the jobspace 124, and the database 126 are all illustrated as being containedwithin the main memory 102, in other embodiments some or all of them maybe on different electronic devices (e.g., the database 126 may be ondirect access storage device 152) and may be accessed remotely (e.g.,via the network 160). Also, although an access plan (AP) cache 136 isillustrated as being contained within the database 126, in otherembodiments the AP cache 136 may be at least partially located elsewhere(e.g., the AP cache 136 may be in the DBMS 120).

The exemplary DBMS 120 includes a query parser 128, a query engine 130,a query optimizer 132, a cursor management system (CMS) 134, and a log135. The query parser 128 is preferably implemented as computer programinstructions that parse a structured query language (SQL) query. An SQLquery is presented to the DBMS 120 in text form, the parameters of theSQL command. The query parser 128 retrieves the elements of the SQLquery from the text form of the query and places them in a datastructure more useful for data processing of an SQL query by the DBMS120.

The query engine 130 performs a query against the database 126 using aquery access plan that the query optimizer 132 creates. When the DBMS120 receives a query, the DBMS 120 interprets the query and the queryoptimizer 132 determines what internal steps are necessary to satisfythe query. These internal steps may include identification of the tableor tables specified in the query, the row or rows selected in the query,and other information such as whether to use an existing index, whetherto build a temporary index, whether to use a temporary file to execute asort, and/or the order in which the tables are to be joined together tosatisfy the query. When taken together, these internal steps aretypically referred to as a “query access plan” or “access plan” (AP),although they are sometimes referred to as an “execution plan”.

As mentioned above, the query optimizer 132 create the query accessplan. The query optimizer 132 is preferably implemented as computerprogram instructions that optimize the access plan in dependence upondatabase management statistics. Database statistics may reveal, forexample, that there are only two storeID values in the transactionstable—so that it is an optimization, that is, more efficient, to scanthe transactions table rather than using an index. Alternatively,database statistics may reveal that there are many transaction recordswith only a few transaction records for each storeID—so that it is anoptimization, that is, more efficient, to access the transaction recordsby an index.

In addition, the query optimizer 132 builds a query cursor from thequery access plan. Query cursors are associated with multirow queries.Query cursors also can be associated with single row queries. A multirowquery is a query that returns more than one row and its execution ishandled in two stages. First, the program starts the query, although nodata is returned immediately. Then, the program requests the rows ofdata one at a time.

These operations are performed using a special data object called a“cursor”. A cursor is an executable data structure that represents thestate of a query, either single row or multirow, and is built from aquery access plan. The following list shows the general sequence ofprogram operations:

1. The program declares the cursor and its associated SELECT statement,which merely allocates storage to hold the cursor.

2. The program opens the cursor, which starts the execution of theassociated SELECT statement and detects any errors in it.

3. The program fetches a row of data into host variables and processesit.

4. The program closes the cursor after the last row is fetched.

5. When the cursor is no longer needed, the program frees the cursor todeallocate the resources it uses.

These operations may, for example, be performed with SQL statementsnamed DECLARE, OPEN, FETCH, CLOSE, and FREE. Thus, an open query cursor,which is sometimes referred to as an open data path (ODP), is the objectbuilt by the query optimizer 132 when a user or application programissues an SQL OPEN statement, and is the live object which returns rowswhen a user or application program issues an SQL FETCH statement.Although SQL is a common interface, other interfaces such as QUERY (IBMiSeries), DDL, XML, etc. may be used to perform the requisiteoperations.

In accordance with the preferred embodiments of the present invention,the CMS 134 provides intelligent management to open query cursors builtby the query optimizer 132 as further described below with reference toFIGS. 2, 3 and 4. For example, the CMS 134 detects whether the openquery cursor was previously requested for use within another job. If theopen query cursor was previously requested, the CMS 134 intelligentlymanages the query cursor for subsequent use within a different job. Forexample, the open query cursor may be recycled by the CMS 134 forsubsequent use within the different job. Hence, system resources are notwasted in building and destroying the same cursors for multiple jobs.Alternatively, the CMS 134 may cause the query cursor to be pre-built bythe query optimizer 132 before the cursor is requested for subsequentuse within the different job.

The CMS 134 detects whether the open query cursor was previouslyrequested for use within another job in accordance with the preferredembodiments of the present invention by keeping a log 135 of recentrequests and/or the most populous requests. Although FIG. 1 illustratesthe log 135 as being included in the DBMS 120, the log 135 may be keptelsewhere, such as in the query access plan.

In accordance with the preferred embodiments of the present invention,another important function of the CMS 134 is lock management. In thisregard, the CMS 134 may obtain, release and re-obtain locks for the openquery cursors it is managing on various tables that the query isexamining. Alternatively, the job that uses the cursor may obtain thelock, although the CMS 134 would still manage the cursor's recyclingand/or pre-building.

In the preferred embodiments of the present invention, the CMS 134,along with the query optimizer 132, include instructions capable ofexecuting on the processors 101 or statements capable of beinginterpreted by instructions executing on the processors 101 to performthe functions as further described below with reference to FIGS. 2, 3and 4. In another embodiment, the query optimizer 132 and/or the CMS 134may be implemented in hardware via logic gates and/or other appropriatehardware techniques in lieu of, or in addition to, a processor-basedsystem.

When the query optimizer 132 creates an access plan for a given query,the access plan is saved by the database management system 120, often inan access plan cache 136 of the database 126. The access plan may alsobe saved in an SQL (Structured Query Language) package (not shown) or inthe program object 122, e.g., the application program that requested thequery. Then, when the user or the program object 122 repeats the query,the database can reutilize the saved access plan instead of undergoingthe time-consuming process of recreating it. Query access plan reuse iswell known in the art. See, for example, U.S. Pat. No. 7,133,861 B2,entitled “QUERY ACCESS PLAN REUSE”, issued on Nov. 7, 2006 to Day etal., and assigned to IBM Corporation, which discloses a method,apparatus and system that determines when to rebuild a query access planand which is hereby incorporated herein by reference.

The program object 122, as mentioned above, represents an applicationprogram that requested the query. The program object 122 may be executedin the job space 124. The job space 124 may include one or more jobs,including jobs requesting the same access plan and/or the same cursorthat was previously requested by another job. Alternatively, these jobsmay exist elsewhere, e.g., within more than one job space.

As discussed above, the database 126 may include an access plan cache136 having a saved access plan 138. The saved access plan 138 is createdby the query optimizer 132 in a conventional manner. In accordance withthe preferred embodiments of the present invention, one or more savedcursors 140 are associated with the saved access plan 138. For example,pre-built or recycled cursors may be kept in a list hanging off theirrespective access plans. Thus, an incoming query from a job will findits access plan, then the incoming query will see that it already hasone or more recycled cursors hanging off of its access plan and grab theone or more recycled cursors (versus building its own cursors). Thecursor is built by the query optimizer 132 from the access plan and theopen query cursor is saved by the CMS 134 preferably in access plancache 136. Alternatively, the open query cursor may be saved in otherlocations, such as in an SQL package or in the program object 122, theapplication program that requested the query. The CMS 134 intelligentlymanages open query cursors, such as saved cursor 140, as furtherdescribed below with reference to FIGS. 2, 3 and 4.

While the CMS 134 is shown separate and discrete from query optimizer132 in FIG. 1, the preferred embodiments expressly extend to the CMS 134being implemented within the query optimizer 132. In addition, the CMS134 may be implemented in the operating system 118 or applicationsoftware, utilities, or other types of software within the scope of thepreferred embodiments.

Computer system 100 utilizes well known virtual addressing mechanismsthat allow the programs of computer system 100 to behave as if they haveaccess to a large, single storage entity instead of access to multiple,smaller storage entities such as main memory 102 and DASD device 152.Therefore, while data 116, operating system 118, DBMS 120, programobject 122, job space 124, and database 126, are shown to reside in mainmemory 102, those skilled in the art will recognize that these items arenot necessarily all completely contained in main memory 102 at the sametime. It should also be noted that the term “memory” is used herein togenerically refer to the entire virtual memory of the computer system100.

Data 116 represents any data that serves as input to or output from anyprogram in computer system 100. Operating system 118 is a multitaskingoperating system known in the industry as OS/400 or IBM i5/OS; however,those skilled in the art will appreciate that the spirit and scope ofthe present invention is not limited to any one operating system.

Processors 101 may be constructed from one or more microprocessorsand/or integrated circuits. Processors 101 execute program instructionsstored in main memory 102. Main memory 102 stores programs and data thatmay be accessed by processors 101. When computer system 100 starts up,processors 101 initially execute the program instructions that make upoperating system 118. Operating system 118 is a sophisticated programthat manages the resources of computer system 100. Some of theseresources are processors 101, main memory 102, mass storage interface104, display interface 106, network interface 108, I/O device interface109 and system bus 110.

Although computer system 100 is shown to contain four processors and asingle system bus, those skilled in the art will appreciate that thepresent invention may be practiced using a computer system that has adifferent number of processors and/or multiple buses. In addition, theinterfaces that are used in the preferred embodiments each includeseparate, fully programmed microprocessors that are used to off-loadcompute-intensive processing from processors 101. However, those skilledin the art will appreciate that the present invention applies equally tocomputer systems that simply use I/O adapters to perform similarfunctions.

Mass storage interface 104 is used to connect mass storage devices (suchas a direct access storage device 152) to computer system 100. Onespecific type of direct access storage device 152 is a readable andwritable CD ROM drive, which may store data to and read data from a CDROM 154.

Display interface 106 is used to directly connect one or more displays156 to computer system 100. These displays 156, which may benon-intelligent (i.e., dumb) terminals or fully programmableworkstations, are used to allow system administrators and users (alsoreferred to herein as “operators”) to communicate with computer system100. Note, however, that while display interface 106 is provided tosupport communication with one or more displays 156, computer system 100does not necessarily require a display 156, because all neededinteraction with users and processes may occur via network interface108.

Network interface 108 is used to connect other computer systems and/orworkstations 158 to computer system 100 across a network 160. Thepresent invention applies equally no matter how computer system 100 maybe connected to other computer systems and/or workstations, regardlessof whether the network connection 160 is made using present-day analogand/or digital techniques or via some networking mechanism of thefuture. In addition, many different network protocols can be used toimplement a network. These protocols are specialized computer programsthat allow computers to communicate across network 160. TCP/IP(Transmission Control Protocol/Internet Protocol) is an example of asuitable network protocol.

The I/O device interface 109 provides an interface to any of variousinput/output devices.

At this point, it is important to note that while this embodiment of thepresent invention has been and will be described in the context of afully functional computer system, those skilled in the art willappreciate that the present invention is capable of being distributed asa program product in a variety of forms, and that the present inventionapplies equally regardless of the particular type of signal bearingmedia used to actually carry out the distribution. Examples of suitablesignal bearing media include: recordable type media such as floppy disksand CD ROMs (e.g., CD ROM 154 of FIG. 1), and transmission type mediasuch as digital and analog communications links (e.g., network 160 inFIG. 1).

FIG. 2 is a flow diagram illustrating a method 200 for intelligent openquery cursor management by recycling query cursors in accordance withthe preferred embodiments of the present invention. The method 200begins with the CMS detecting the repeated need for particular querycursors (step 210). Step 210 may, for example, include detecting whetheran open query cursor, which was opened for use within a first job, waspreviously requested for use within another job. In accordance with thepreferred embodiments of the present invention, the CMS checks a log ofrecent or most populous requests to see if the open query cursor wasrequested for use within another job. The repeated need for a particularquery cursor may, for example, be determined by whether the logindicates that the open query cursor has been requested at apredetermined threshold level (e.g., requested at least a predeterminednumber of times within a predetermined period of time and/or requestedat least at a predetermined percentile with respect to a total sample ofrequests, such as within the top decile, quintile, or quartile).

The method 200 continues with the CMS updating the log to include anentry corresponding to the open query cursor (step 220).

The method 200 continues with the CMS recycling the query cursors forwhich a repeated need was detected in step 210 (step 230). In step 230,the CMS may save an open query cursor, which was opened for use within afirst job, for subsequent use within a different job. In accordance withthe preferred embodiments of the present invention, the recycled querycursors are saved in a list hanging off their respective access plans.Thus, an incoming query from a job will find its access plan, then theincoming query will see that it already has one or more recycled cursorshanging off of its access plan and grab the one or more recycled cursors(versus building its own cursors).

In accordance with the preferred embodiments of the present invention,the method 200 continues with the CMS dynamically adjusting the openquery cursors that it is managing (step 240). Preferably, the CMS isable to intelligently adjust the number and/or identity of theparticular cursors being managed based on patterns in demand for variousqueries. For example, one week query A might be the most popular amongusers, whereas a different week query B may be the most popular. The CMSpreferably adjusts to the demand of the users for given queries. Step240 may, for example, include periodically rechecking the log of recentand/or most popular requests to see if the saved query cursors continueto be requested at a predetermined threshold level.

FIG. 3 is a flow diagram illustrating a method 300 for intelligent openquery cursor management by pre-building query cursors in accordance withthe preferred embodiments of the present invention. The method 300begins with the CMS detecting the repeated need for particular querycursors (step 310). Step 310 may, for example, include detecting whetheran open query cursor, which was opened for use within a first job, waspreviously requested for use within another job. In accordance with thepreferred embodiments of the present invention, the CMS checks a log ofrecent or most populous requests to see if the open query cursor wasrequested for use within another job. The repeated need for a particularquery cursor may, for example, be determined by whether the logindicates that the open query cursor has been requested at apredetermined threshold level (e.g., requested at least a predeterminednumber of times within a predetermined period of time and/or requestedat least at a predetermined percentile with respect to a total sample ofrequests, such as within the top decile, quintile, or quartile).

The method 300 continues with the CMS updating the log to include anentry corresponding to the open query cursor (step 320).

The method 300 continues with the CMS pre-building the query cursors forwhich a repeated need was detected in step 310 (step 330). Step 330 may,for example, include checking the log of recent and/or most popularrequests for patterns in demand for various queries and predicting atime when a particular query cursor will be requested again. In step330, the CMS may, for example, cause the query optimizer to pre-buildquery cursors ahead of the predicted time and save the pre-built cursorsin a list hanging off their respective access plans. Thus, an incomingquery from a job will find its access plan, then the incoming query willsee that it already has one or more pre-built cursors hanging off of itsaccess plan and grab the one or more pre-built cursors (versus buildingits own cursors).

In accordance with the preferred embodiments of the present invention,the method 300 continues with the CMS dynamically adjusting the querycursors that it is managing (step 340). Preferably, the CMS is able tointelligently adjust the number and/or identity of the particularcursors being managed based on patterns in demand for various queries.For example, one week query A might be the most popular among users,whereas a different week query B may be the most popular. The CMSpreferably adjusts to the demand of the users for given queries. Step340 may, for example, include periodically rechecking the log of recentand/or most popular requests to see if the query cursors designated forpre-building continue to be requested at a predetermined thresholdlevel.

In the first illustrative problem scenario set forth above in theBackground section, one thousand users at a typical call center logontheir computer system at 8:00 am. They all run an application withtwenty-five common queries. Therefore, at 8:00 am, a conventionalcomputer system must perform “full opens” on twenty-five thousandqueries (i.e., 1000×25 queries). At a CPU cost of about ½ second per afull open, a considerable CPU cost spike of 208 CPU minutes occurs inthe conventional computer system at 8:00 am. A similar CPU cost spikemay be felt in the conventional computer system at other times duringthe day, such as after lunch when all of the users again logon theircomputer system. In accordance with the preferred embodiments of thepresent invention, the CMS pre-builds or recycles cursors to addressthis CPU cost spike problem. For example, the CMS may begin early in themorning creating twenty-five thousand open cursors that the CMS knowswill be needed by 8:00 am. Alternatively, the CMS may cause the cursorsnot to be deleted as they normally would when the users signoff, butinstead holds the cursors for use the next morning when the users arriveagain.

The second illustrative problem scenario occurs in the context of anonline web retail application. Multiple users throughout the day run ahandful of the same queries, such as lookup product X. In a conventionalcomputer system, each of the users must pay a full open hit when theysign on, as the cursors are built, when the query is run, when the queryis closed, and when the ODP is destroyed. No users benefit from thesimilar full opens of other users that occurred previously.Consequently, in a conventional computer system, CPU time is wasted bybuilding the same query cursor over and over for different users. Inaccordance with the preferred embodiments of the present invention, theCMS pre-builds or recycles cursors to address this problem. For example,the CMS may keep the open cursors from a first user who has signed offand pass them to a second user signing on. Alternatively, the CMS maytrack how many open cursors of each particular query it needs on anaverage day. In this alternative embodiment, the CMS then creates thosecursors ahead of time and hands them out as needed.

In accordance with the preferred embodiments of the present invention,it may also be desirable to incorporate a lock management mechanism intothe CMS to provide different levels of commit (i.e., isolation).

FIG. 4 is a flow diagram illustrating a method 400 for intelligent openquery cursor management that incorporates a lock management mechanism inaccordance with the preferred embodiments of the present invention. Themethod 400 begins with the CMS obtaining locks for the cursors it ismanaging on various tables that a query is looking at (step 410). TheCMS must, however, be cognizant when it must release its locks forcurrently running jobs requesting exclusive locks, such as an updatelock. As is well known in the art, such exclusive lock requests may bemonitored by an open query cursor. Consequently, the method 400continues with the CMS listening for any exclusive lock requests (step420). If an exclusive lock request is detected in step 420, the method400 continues with the CMS releasing its locks as appropriate for thecursor (step 430). Then, the method 400 continues with the CMSre-gathering the locks after the exclusive lock request goes through(step 440).

One of ordinary skill in the art will recognize that variousmodifications of the lock management mechanism are possible. Forexample, the CMS may monitor how aggressively to set up various locksfor its cursors depending on how much resource it must use to releaseand reacquire them. In most systems, even frequent obtaining, releasing,and re-obtaining of locks will be cheaper in terms of resource use thanperforming the extra full opens.

In an alternative embodiment, the CMS will manage the building of theopen cursors, but not obtain any locks. According to this alternativeembodiment, the job that uses the cursor will be required to obtain thelock in a conventional manner, but the work of building the cursor willbe managed by the CMS.

One skilled in the art will appreciate that many variations are possiblewithin the scope of the present invention. Thus, while the presentinvention has been particularly shown and described with reference topreferred embodiments thereof, it will be understood by those skilled inthe art that changes in form and details may be made therein withoutdeparting from the spirit and scope of the present invention.

1. A computer-implemented method for intelligent open query cursormanagement, comprising the steps of: opening a query cursor for usewithin a first job; detecting whether the open query cursor waspreviously requested for use within another job; if the open querycursor was previously requested for use within another job,intelligently managing the query cursor for subsequent use within adifferent job.
 2. The computer-implemented method as recited in claim 1,wherein the step of intelligently managing the query cursor forsubsequent use within a different job includes either the step ofrecycling the open query cursor for subsequent use within the differentjob or the step of pre-building the query cursor before it is requestedfor subsequent use within the different job.
 3. The computer-implementedmethod as recited in claim 2, wherein the open query cursor is builtfrom a query access plan, and wherein either the recycled query cursoror the pre-built query cursor is kept in a list hanging off the queryaccess plan.
 4. The computer-implemented method as recited in claim 1,wherein the step of intelligently managing the query cursor forsubsequent use within a different job includes the step of saving theopen query cursor for subsequent use within the different job.
 5. Thecomputer-implemented method as recited in claim 1, wherein the step ofintelligently managing the query cursor for subsequent use within adifferent job includes the steps of: predicting a time when the querycursor will be requested for use within the different job; pre-buildingthe query cursor ahead of the predicted time.
 6. Thecomputer-implemented method as recited in claim 1, wherein the openquery cursor is built by a query optimizer of a database managementsystem (DBMS) from a query access plan, wherein the step of detectingwhether the open query cursor was previously requested for use withinanother job includes the step of keeping a log of at least one of recentrequests and/or most populous requests, and wherein the log is kept inat least one of the DBMS and/or the query access plan.
 7. Thecomputer-implemented method as recited in claim 1, further comprisingthe steps of: obtaining a lock for the open query cursor; releasing thelock for the open query cursor in response to a request from a currentlyrunning job for an exclusive lock; re-obtaining the lock for the openquery cursor subsequent to the exclusive lock request.
 8. A dataprocessing system, comprising: a processor; a memory coupled via a busto the processor, the memory encoded with instructions that whenexecuted by the processor comprise the steps of: opening a query cursorfor use within a first job; detecting whether the open query cursor waspreviously requested for use within another job; if the open querycursor was previously requested for use within another job,intelligently managing the query cursor for subsequent use within adifferent job.
 9. The data processing system as recited in claim 8,wherein the step of intelligently managing the query cursor forsubsequent use within a different job includes either the step ofrecycling the open query cursor for subsequent use within the differentjob or the step of pre-building the query cursor before it is requestedfor subsequent use within the different job.
 10. The data processingsystem as recited in claim 9, wherein the open query cursor is builtfrom a query access plan, and wherein either the recycled query cursoror the pre-built query cursor is kept in a list hanging off the queryaccess plan.
 11. The data processing system as recited in claim 8,wherein the step of intelligently managing the query cursor forsubsequent use within a different job includes the step of saving theopen query cursor for subsequent use within the different job.
 12. Thedata processing system as recited in claim 8, wherein the step ofintelligently managing the query cursor for subsequent use within adifferent job includes the steps of: predicting a time when the querycursor will be requested for use within the different job; pre-buildingthe query cursor ahead of the predicted time.
 13. The data processingsystem as recited in claim 8, wherein the open query cursor is built bya query optimizer of a database management system (DBMS) from a queryaccess plan, wherein the step of detecting whether the open query cursorwas previously requested for use within another job includes the step ofkeeping a log of at least one of recent requests and/or most populousrequests, and wherein the log is kept in at least one of the DBMS and/orthe query access plan.
 14. The data processing system as recited inclaim 8, wherein the instructions when executed on the processor furthercomprising the steps of: obtaining a lock for the open query cursor;releasing the lock for the open query cursor in response to a requestfrom a currently running job for an exclusive lock; re-obtaining thelock for the open query cursor subsequent to the exclusive lock request.15. A computer program product for implementing intelligent open querycursor management in a digital computing device having at least oneprocessor, comprising: a plurality of executable instructions providedon computer readable signal bearing media, wherein the executableinstructions, when executed by the at least one processor, cause thedigital computing device to perform the steps of: opening a query cursorfor use within a first job; detecting whether the open query cursor waspreviously requested for use within another job; if the open querycursor was previously requested for use within another job,intelligently managing the query cursor for subsequent use within adifferent job.
 16. The computer program product as recited in claim 15,wherein the signal bearing media comprises recordable media.
 17. Thecomputer program product as recited in claim 15, wherein the signalbearing media comprises transmission media.
 18. The computer programproduct as recited in claim 15, wherein the step of intelligentlymanaging the query cursor for subsequent use within a different jobincludes either the step of recycling the open query cursor forsubsequent use within the different job or the step of pre-building thequery cursor before it is requested for subsequent use within thedifferent job.
 19. The computer program product as recited in claim 18,wherein the open query cursor is built from a query access plan, andwherein either the recycled query cursor or the pre-built query cursoris kept in a list hanging off the query access plan.
 20. The computerprogram product as recited in claim 15, wherein the step ofintelligently managing the query cursor for subsequent use within adifferent job includes the step of saving the open query cursor forsubsequent use within the different job.
 21. The computer programproduct as recited in claim 15, wherein the step of intelligentlymanaging the query cursor for subsequent use within a different jobincludes the steps of: predicting a time when the query cursor will berequested for use within the different job; pre-building the querycursor ahead of the predicted time.
 22. The computer program product asrecited in claim 15, wherein the open query cursor is built by a queryoptimizer of a database management system (DBMS) from a query accessplan, wherein the step of detecting whether the open query cursor waspreviously requested for use within another job includes the step ofkeeping a log of at least one of recent requests and/or most populousrequests, and wherein the log is kept in at least one of the DBMS and/orthe query access plan.
 23. The computer program product as recited inclaim 15, wherein the executable instructions, when executed by the atleast one processor, further cause the digital computing device toperform the steps of: obtaining a lock for the open query cursor;releasing the lock for the open query cursor in response to a requestfrom a currently running job for an exclusive lock; re-obtaining thelock for the open query cursor subsequent to the exclusive lock request.24. An apparatus, comprising: a query optimizer for opening a querycursor for use within a first job; a cursor management systemcomprising: means for detecting whether the open query cursor waspreviously requested for use within another job; means for intelligentlymanaging the query cursor for subsequent use within a different job. 25.The apparatus as recited in claim 24, wherein the means forintelligently managing the query cursor for subsequent use within adifferent job either recycles the open query cursor for subsequent usewithin the different job or pre-builds the query cursor before it isrequested for subsequent use within the different job.